RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion

RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

individual papers by the papers' authors. Copying permitted only for private and academic purposes. This volume is published and copyrighted by its editors.

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Experiments with Parallel Algorithms for Combinatorial Problems

In the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines constructed so far all use a simple model of parallel computation. Therefore, not every existing parallel ma...

Neurogenetic Algorithm for Solving Combinatorial Engineering Problems

Diversity of the population in a genetic algorithm plays an important role in impeding premature convergence. This paper proposes an adaptive neurofuzzy inference system genetic algorithm based on sexual selection. In this technique, for choosing the female chromosome during sexual selection, a bilinear allocation lifetime approach is used to label the chromosomes based on their fitness value w...

On Solving Combinatorial Optimization Problems

We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...